Recursive Nearest Agglomeration (ReNA): Fast Clustering for Approximation of Structured Signals
نویسندگان
چکیده
منابع مشابه
Recursive nearest agglomeration (ReNA): fast clustering for approximation of structured signals
In this work, we revisit fast dimension reduction approaches, as with random projections and random sampling. Our goal is to summarize the data to decrease computational costs and memory footprint of subsequent analysis. Such dimension reduction can be very efficient when the signals of interest have a strong structure, such as with images. We focus on this setting and investigate feature clust...
متن کاملFast reciprocal nearest neighbors clustering
This paper presents a novel approach for accelerating the popular Reciprocal Nearest Neighbors (RNN) clustering algorithm, i.e. the fast-RNN. We speed up the nearest neighbor chains construction via a novel dynamic slicing strategy for the projection search paradigm. We detail an efficient implementation of the clustering algorithm along with a novel data structure, and present extensive experi...
متن کاملFast Tree-Structured Recursive Neural Tensor Networks
In this project we explore different ways in which we can optimize the computation of training a Tree-structured RNTN, in particular batching techniques in combining many matrix-vector multiplications into matrix-matrix multiplications, and many tensor-vector operations into tensor-matrix operations. We assume that training is performed using mini-batch AdaGrad algorithm, and explore how we can...
متن کاملFast tree-structured nearest neighbor encoding for vector quantization
This work examines the nearest neighbor encoding problem with an unstructured codebook of arbitrary size and vector dimension. We propose a new tree-structured nearest neighbor encoding method that significantly reduces the complexity of the full-search method without any performance degradation in terms of distortion. Our method consists of efficient algorithms for constructing a binary tree f...
متن کاملFast Approximation Algorithms for Spectral Clustering
The sponsor of this project is the Business Analytics and Mathematical Sciences (BAMS) Department of the IBM T.J. Watson Research Center in New York. The industry Mentor is Christos Boutsidis and the mentor team consists of Christos, Bo Zhang, and Daniel Connors, all part of BAMS, IBM. The best way to reach Christos is: [email protected]. His number at work in New York is 914-945-1972.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2019
ISSN: 0162-8828,2160-9292,1939-3539
DOI: 10.1109/tpami.2018.2815524